ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches

نویسندگان

  • Mudashiru Busari
  • Carey L. Williamson
چکیده

This paper describes the design and use of a synthetic Web proxy workload generator called ProWGen to investigate the sensitivity of Web proxy cache replacement policies to five selected Web workload characteristics. Three representative cache replacement policies are considered in the simulation study: a recency-based policy called Least-Recently-Used (LRU), a frequency-based policy called Least-Frequently-Used-with-Aging (LFU-Aging), and a size-based policy called Greedy-Dual-Size (GD-Size). Trace-driven simulations with synthetic workloads from ProWGen show the relative sensitivity of these cache replacement policies to three Web workload characteristics: the slope of the Zipf-like document popularity distribution, the degree of temporal locality in the document referencing behaviour, and the correlation (if any) between document size and document popularity. The three replacement policies are relatively insensitive to the percentage of one-timers in the workload, and to the Pareto tail index of the heavy-tailed document size distribution. Performance differences between the three cache replacement policies are also highlighted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

WebTraff: A GUI for Web Proxy Cache Workload Modeling and Analysis

This paper describes an interactive graphical user interface (GUI) that can be used for the modeling and analysis of Web proxy workloads. The WebTraff GUI has three main components. First, the WebTraff tool provides a visual front-end to ProWGen, a Web proxy workload generation tool developed in prior work, which can be used for generating synthetic Web proxy workloads of arbitrary length, with...

متن کامل

On the Sensitivity of Web Proxy Cache Performance to Workload Characteristics

This paper describes the design and use of a synthetic Web proxy workload generator (ProWGen) to investigate the sensitivity of proxy cache replacement policies to selected Web workload characteristics. Tracedriven simulations with synthetic workloads from ProWGen show the relative sensitivity of three popular cache replacement algorithms – LRU, LFUAging, and GD-Size – to Zipf slope, temporal l...

متن کامل

Evaluation of Randomized Replacement Policies for Web Caches

This paper presents a comparison of the performance of seven randomized replacement policies proposed for Web caching (RAND, HARMONIC, LRU-C, LRU-S, CLIMB-C, CLIMB-S and RRGVF) and the classical LRU scheme widely used in Web proxy caches. This comparison is performed using a Web cache simulator that implements the aforementioned replacement policies and uses a workload of real proxy traces to s...

متن کامل

A Survey of Proxy Cache Evaluation Techniques

Proxy caches are increasingly used around the world to reduce bandwidth requirements and alleviate delays associated with the World-Wide Web. In order to compare proxy cache performances, objective measurements must be made. In this paper, we define a space of proxy evaluation methodologies based on source of workload used and form of algorithm implementation. We then survey recent publications...

متن کامل

Performance Evaluation of Web Proxy Cache Replacement Policies

The continued growth of the World-Wide Web and the emergence of new end-user technologies such as cable modems necessitate the use of proxy caches to reduce latency, network traffic and Web server loads. In this paper we analyze the importance of different Web proxy workload characteristics in making good cache replacement decisions. We evaluate workload characteristics such as object size, rec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2002